Hamiltonian degree conditions for tough graphs
نویسندگان
چکیده
منابع مشابه
Degree conditions for k-ordered hamiltonian graphs
For a positive integer k, a graph G is k-ordered hamiltonian if for every ordered sequence of k vertices there is a hamiltonian cycle that encounters the vertices of the sequence in the given order. It is shown that if G is a graph of order n with 3 k n /2, and deg(u)þ deg(v ) nþ (3k 9)/2 for every pair u; v of nonadjacent vertices of G, then G is k-ordered hamiltonian. Minimum degree condition...
متن کاملImproved degree conditions for Hamiltonian properties
In 1980, Bondy proved that for an integer k ≥ 2 a (k+ s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least 1 2 ((k+1)(n+ s−1)+1). This generalizes the well-known sufficient conditions of Dirac (k = 0) and Ore (k = 1). The condition in Bondy’s Theorem is not ...
متن کاملAn update on non-Hamiltonian 54-tough maximal planar graphs
Studying the shortness of longest cycles in maximal planar graphs, we improve the upper bound on the shortness exponent of the class of 54 -tough maximal planar graphs presented by Harant and Owens [Discrete Math. 147 (1995), 301–305]. In addition, we present two generalizations of a similar result of Tkáč who considered 1-tough maximal planar graphs [Discrete Math. 154 (1996), 321–328]; we rem...
متن کاملNew Conditions for k-ordered Hamiltonian Graphs
We show that in any graph G on n vertices with d(x) + d(y) ≥ n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian cycle encountering these vertices in the same order, as long as k < n/12 and G is d(k + 1)/2e-connected. Further we show that every b3k/2cconnected graph on n vertices with d(x) + d(y) ≥ n for any two nonadjacent vert...
متن کاملHamiltonian graphs involving neighborhood conditions
Let G be a graph on n vertices, δ and α be the minimum degree and independence number of G, respectively. In this paper we prove that if G is a 2-connected graph and |N(x) ∪ N(y)| ≥ n − δ − 1 for each pair of nonadjacent vertices x, y with 1 ≤ |N(x) ∩ N(y)| ≤ α − 1, then G is hamiltonian or G ∈ {Gn−1 2 ,Kn+1 2 ,K∗ 2 ∨ 3Kn−2 3 } where K∗ 2 and Gn−1 2 are subgraphs on 2 and n−1 2 vertices respect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0214-o